Performance Evaluation of Bender’s Decomposition Algorithm

نویسندگان

  • N. Aruna Madhuri
  • B. Eswara Reddy
چکیده

In cloud computing, provisioning an optimal resource to consumer gets more and more crucial. Cloud computing consumers are able to use the set of computing resources by net. Cloud providers will receive some amount for these computational resources depending on usage of cloud resource. The provisional resource plans are reservation and also on demand. The computing resources will be provided based on cloud resource provisioning concept. In this concept resource charge is high due to the hard to find optimization of resource price in uncertainty. The resource optimization price is depends on indefiniteness of resource provisioning charge. The indefiniteness of resource provisioning charge consists of: on demand price, reservation price, expending price. This results in difficulty to accomplish resource provisioning optimization price in computing cloud. The Integer Stochastic Programming is applied for the problem to achieve resource providing optimum cost. The Two Stage Integer Stochastic Programming with recourse is applied to find a solution for the complexity problem optimization in uncertainty. The stochastic programming is extended as Deterministic Equivalent Formulation to solve the probability distribution of entire scenarios to decrease the on demand price. The Decomposition Bender’s is applied to divide the resource optimization problem into many sub problems to decrease the on demand cost and reservation cost. Scenario Tree Generation is considered in order to represent scenarios. Scenario Reduction Techniques are applied to reduce problem by reducing number of scenarios. This will decrease reservation price and expending price. N. Aruna Madhuri & B. Eswara Reddy 218

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Tutorial on cutting plane methods for economic dispatch problems

In this article, three economic dispatch examples will be given to show the philosophy and general steps on cutting plane methods (Bender’s decomposition and Branch and Bound (B&B) algorithm). Bender’s decomposition employs duality to generate cuts, while B&B employs linear programming (LP) relaxation to find lower bound for a minimization problem and generate subregions. We will show a continu...

متن کامل

Benders Decomposition Algorithm for Competitive Supply Chain Network Design under Risk of Disruption and Uncertainty

In this paper, bi-level programming is proposed for designing a competitive supply chain network. A two-stage stochastic programming approach has been developed for a multi-product supply chain comprising a capacitated supplier, several distribution centers, retailers and some resellers in the market. The proposed model considers demand’s uncertainty and disruption in distribution centers and t...

متن کامل

Solving railway line planning problems using a decomposition algorithm

The passenger line planning is a process of strategic long-term decision-making problem in the field of railway passenger planning. A line is a route between starting point and destination with certain stops, which has a certain frequency of train schedule. A new solution based on decomposition algorithm has been proposed in this paper, which is defined in a master problem and two sub problems....

متن کامل

Benders’ decomposition algorithm to solve bi-level bi-objective scheduling of aircrafts and gate assignment under uncertainty

Management and scheduling of flights and assignment of gates to aircraft play a significant role to improve the performance of the airport, due to the growing number of flights and decreasing the flight times. This research addresses the assignement and scheduling problem of runways and gates simultaneously. Moreover, this research is the first study that considers the constraint of unavailabil...

متن کامل

A MULTI-OBJECTIVE EVOLUTIONARY ALGORITHM USING DECOMPOSITION (MOEA/D) AND ITS APPLICATION IN MULTIPURPOSE MULTI-RESERVOIR OPERATIONS

This paper presents a Multi-Objective Evolutionary Algorithm based on Decomposition (MOEA/D) for the optimal operation of a complex multipurpose and multi-reservoir system. Firstly, MOEA/D decomposes a multi-objective optimization problem into a number of scalar optimization sub-problems and optimizes them simultaneously. It uses information of its several neighboring sub-problems for optimizin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007